A flexible knowledge discovery system using genetic programming and logic grammars
نویسنده
چکیده
As the computing world moves from the information age into the knowledge-base age, it is beneficial to induce knowledge from the information superhighway formed from the Internet and intranet. Knowledge discovery in databases is defined as the non-trivial process of identifying valid, novel, potentially useful, and ultimately understandable patterns in data stored in databases. The knowledge acquired can be expressed in different knowledge representations such as computer programs, first-order logical relations, or Fuzzy Petri Nets (FPNs). In this paper, we present a flexible knowledge discovery system called LOGENPRO (The LOgic grammar based GENetic PROgramming system) that applies genetic programming and logic grammars to learn knowledge in various knowledge representation formalisms. The system is also powerful enough to represent context-sensitive information and domain-dependent knowledge. An experiment is performed to demonstrate that LOGENPRO can discover knowledge represented in FPNs that support fuzzy and approximate reasoning. To evaluate the performance of LOGENPRO in producing good FPNs, the classification accuracy of the fuzzy Petri net induced by LOGENPRO and that of the decision tree generated by C4.5 are compared. Moreover, the performance of LOGENPRO in inducing logic programs from noisy examples is evaluated. A detailed comparison to FOIL, a system that induces logic programs, has been conducted. These experiments demonstrate that LOGENPRO is a promising alternative to other knowledge discovery systems and sometimes is superior for handling noisy and inexact data. Area: Knowledge Discovery in Databases, Genetic Programming, Logic Grammars, Fuzzy Petri Nets
منابع مشابه
Applying logic grammars to induce sub-functions in genetic programming
Genetic Programming (GP) is a method of automatically inducing S-expression in LISP to perform specified tasks. The problem of inducing programs can be reformulated as a search for a highly fit program in the space of all possible programs. This paper presents a framework in which the search space can be specified declaratively by a user. Its application in inducing sub-functions is detailed. T...
متن کاملAn induction system that learns programs in different programming languages using genetic programming and logic grammars
Genetic Programming (GP) and Inductive Logic Programming (ILP) have received increasing interest recently. Since their formalisms are so different, these two approaches cannot be integrated easily though they share many common goals and functionalities. A unification will greatly enhance their problem solving power. Moreover, they are restricted in the computer languages in which programs can b...
متن کاملEvolutionary program induction directed by logic grammars
Program induction generates a computer program that can produce the desired behavior for a given set of situations. Two of the approaches in program induction are inductive logic programming (ILP) and genetic programming (GP). Since their formalisms are so different, these two approaches cannot be integrated easily, although they share many common goals and functionalities. A unification will g...
متن کاملCombining Genetic Programming and Inductive Logic Programming using Logic Grammars
Genetic Programming (GP) and Inductive Logic Programming (ILP) have received increasing interest recently. Since their formalisms are so different, these two approaches cannot be integrated easily though they share many common goals and functionalities. A unification will greatly enhance their problem solving power. In this paper, a framework to combine GP and ILP is presented. The framework is...
متن کاملLearning Programs in Different Paradigms using Genetic Programming
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to parse trees. Hence, GP should be able to handle them as well. In practice, the syntax of Lisp is so simple and uniform that the translation process can be achieved easily, programs evolved by GP are usually expressed in L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Decision Support Systems
دوره 31 شماره
صفحات -
تاریخ انتشار 2001